Borel Chromatic Numbers

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak Borel chromatic numbers

Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that covers all of X. Here a set of vertices of a graph G is independent if no two vertices in the set are connected by an edge. We show that it is consistent with an arbitrarily large size of the continuum that every closed ...

متن کامل

A Bound on Measurable Chromatic Numbers of Locally Finite Borel Graphs

We show that the Baire measurable chromatic number of every locally finite Borel graph on a non-empty Polish space is strictly less than twice its ordinary chromatic number, provided this ordinary chromatic number is finite. In the special case that the connectedness equivalence relation is hyperfinite, we obtain the analogous result for the μ-measurable chromatic number.

متن کامل

Borel chromatic number of closed graphs

We construct, for each countable ordinal ξ, a closed graph with Borel chromatic number two and Baire class ξ chromatic number א0. 2010 Mathematics Subject Classification. Primary: 03E15, Secondary: 54H05

متن کامل

Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers

Karger, Motwani and Sudan (JACM 1998) introduced the notion of a vector coloring of a graph. In particular they show that every k-colorable graph is also vector kcolorable, and that for constant k, graphs that are vector kcolorable can be colored by roughly 1 2=k colors. Here is the maximum degree in the graph. Their results play a major role in the best approximation algorithms for coloring an...

متن کامل

Chromatic numbers and products

Let Λ(n) be the smallest number so that there are two n chromatic graphs whose product has chromatic number Λ(n). Under the assumption that a certain sharper result than one obtained by Duffus, Sands and Woodrow [1] holds we will prove that Λ(n) ≥ n/2. MR Subject Classifications [2000]: 05C15 Keyworks: chromatic number, graph product, Hedeniemi conjecture

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 1999

ISSN: 0001-8708

DOI: 10.1006/aima.1998.1771